Searching Prime Numbers with Short Binary Signed Representation
نویسندگان
چکیده
Modular arithmetic with prime moduli has been crucial in present day cryptography. The primes of Mersenne, Solinas, Crandall and the so called IKE-MODP primes have been widely used in efficient implementations. In this paper we study the density of primes with binary signed representation involving a small number of non-zero ±1-digits, and its repercussion in the generation of those primes.
منابع مشابه
Counting Prime Numbers with Short Binary Signed Representation
Modular arithmetic with prime moduli has been crucial in present day cryptography. The primes of Mersenne, Solinas, Crandall and the so called IKE-MODP have been extensively used in efficient implementations. In this paper we study the density of primes with binary signed representation involving a small number of non-zero ±1-digits.
متن کاملSigned-bit representations of real numbers
The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use −1. It lends itself especially well to the constructive (intuitionistic) theory of the real numbers. The first part of the paper develops and studies the signed-bit equivalents of three common notions of a real number: Dedekind cuts, Cauchy sequences, and regular sequence...
متن کاملRandomness with Respect to the Signed-Digit Representation
The ordinary notion of algorithmic randomness of reals can be characterised as MartinLöf randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic ...
متن کاملModular Multipliers Using a Modified Residue Addition Algorithm with Signed-Digit Number Representation
In this paper, we present multipliers using a modified addition algorithm modulo m with a signed-digit(SD) number representation where m = 2 − 1, 2 or 2 + 1. To simplify an SD modular adder, new addition rules are proposed for generating the intermediate sum and carry with a binary number representation. By using the new codes for intermediate sum and carry and the end-around carry architecture...
متن کاملEfficient squaring circuit using canonical signed-digit number representation
Squaring and exponentiation of a number are fundamental arithmetic and widely used in the real-time applications such as image processing, digital filtering and cryptography. In this paper, we propose a squaring algorithm of an integer with canonical signed-digit (CSD) number representation. For an n-digit CSD number, our method generates n/4 CSD numbers of 2n-digit length as partial products. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computación y Sistemas
دوره 12 شماره
صفحات -
تاریخ انتشار 2009